Ensemble Analysis on Minimum Span of Stopping Sets
نویسنده
چکیده
In this paper, the minimum span of stopping sets of regular LDPC codes are defined and analyzed. The minimum span of an LDPC code is closely related to immunity to burst erasures when an LDPC code is decoded with belief propagation (BP) for erasure channels. The minimum span of stopping sets is the smallest span of a non-empty stopping set. If a single erasure burst of length shorter than the minimum span, the erasure burst can be corrected with BP. In order to study the nature of the minimum span, we use ensemble analysis for the bipartite graph ensemble.
منابع مشابه
A Combined Matrix Ensemble of Low-Density Parity-Check Codes for Correcting a Solid Burst Erasure
A new ensemble of low-density parity-check (LDPC) codes for correcting a solid burst erasure is proposed. This ensemble is an instance of a combined matrix ensemble obtained by concatenating some LDPC matrices. We derive a new bound on the critical minimum span ratio of stopping sets for the proposed code ensemble by modifying the bound for ordinary code ensemble. By calculating this bound, we ...
متن کاملOptimal ensemble averaging of neural networks
Based on an observation about the different effect of ensemble averaging on the bias and variance portions of the prediction error, we discuss training methodologies for ensembles of networks. We demonstrate the effect of variance reduction and present a method of extrapolation to the limit of an infinite ensemble. A significant reduction of variance is obtained by averaging just over initial c...
متن کاملA new Algorithm to construct LDPC codes with large stopping sets
A new algorithm to construct good low-density parity-check (LDPC) codes with large stopping sets is presented. Since the minimum stopping set characterizes an LDPC code, searching for stopping sets in LDPC codes is an important issue. Large minimum stopping sets avoid the LDPC code to get trapped in cycles specially on the binary erasure channel. Dealing with stopping sets is not an easy task s...
متن کاملTuning diversity in bagged neural network ensembles
In this paper we address the issue of how to optimize the generalization performance of bagged neural network ensembles. We investigate how diversity amongst networks in bagged ensembles can signiicantly innuence ensemble generalization performance and propose a new early-stopping technique that eeectively tunes this diversity so that overall ensemble generalization performance is optimized. Ex...
متن کاملFinding Small Stopping Sets in the Tanner Graphs of LDPC Codes
The performance of low-density parity-check (LDPC) codes over the binary erasure channel for a low erasure probability is limited by small stopping sets. The frame error rate over the additive white Gaussian noise (AWGN) channel for a high signal-to-noise ratio is limited by small trapping sets and by the minimum distance of the LDPC code, which is equal to the codeword with the minimal Hamming...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006